On Robustness of Kernel Principal Component Analysis using Fast HCS
نویسندگان
چکیده
منابع مشابه
Fast Iterative Kernel Principal Component Analysis
We develop gain adaptation methods that improve convergence of the Kernel Hebbian Algorithm (KHA) for iterative kernel PCA (Kim et al., 2005). KHA has a scalar gain parameter which is either held constant or decreased according to a predetermined annealing schedule, leading to slow convergence. We accelerate it by incorporating the reciprocal of the current estimated eigenvalues as part of a ga...
متن کاملKernel Principal Component Analysis
A new method for performing a nonlinear form of Principal Component Analysis is proposed. By the use of integral operator kernel functions, one can e ciently compute principal components in high{ dimensional feature spaces, related to input space by some nonlinear map; for instance the space of all possible d{pixel products in images. We give the derivation of the method and present experimenta...
متن کاملPhoneme Classification Using Kernel Principal Component Analysis
A substantial number of linear and nonlinear feature space transformation methods have been proposed in recent years. Using the so-called ”kernel-idea” well-known linear techniques such as Principal Component Analysis(PCA), Linear Discriminant Analysis(LDA) and Independent Component Analysis(ICA) can be non-linearized in a general way. The aim of this paper here is twofold. First, we describe t...
متن کاملRobust Kernel Principal Component Analysis
Kernel Principal Component Analysis (KPCA) is a popular generalization of linear PCA that allows non-linear feature extraction. In KPCA, data in the input space is mapped to higher (usually) dimensional feature space where the data can be linearly modeled. The feature space is typically induced implicitly by a kernel function, and linear PCA in the feature space is performed via the kernel tric...
متن کاملStreaming Kernel Principal Component Analysis
Kernel principal component analysis (KPCA) provides a concise set of basis vectors which capture nonlinear structures within large data sets, and is a central tool in data analysis and learning. To allow for nonlinear relations, typically a full n ⇥ n kernel matrix is constructed over n data points, but this requires too much space and time for large values of n. Techniques such as the Nyström ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF MECHANICS OF CONTINUA AND MATHEMATICAL SCIENCES
سال: 2019
ISSN: 0973-8975,2454-7190
DOI: 10.26782/jmcms.2019.08.00024